By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 9, Issue 2, pp. 219-439

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Multiterminal Minimum Cut Algorithm for Planar Graphs

Yossi Shiloach

pp. 219-224

BibTeX  Abstract Full Text:  PDF

On Multiplication of Polynomials Modulo a Polynomial

S. Winograd

pp. 225-229

BibTeX  Abstract Full Text:  PDF

On the Evaluation of Powers and Monomials

Nicholas Pippenger

pp. 230-250

BibTeX  Abstract Full Text:  PDF

Efficient Synthesis and Implementation of Large Discrete Fourier Transformations

Salvatore D. Morgera

pp. 251-272

BibTeX  Abstract Full Text:  PDF

Probabilistic Algorithms in Finite Fields

Michael O. Rabin

pp. 273-280

BibTeX  Abstract Full Text:  PDF

A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem

D. G. Corneil and D. G. Kirkpatrick

pp. 281-297

BibTeX  Abstract Full Text:  PDF

Optimal Merging of $3$ Elements with $n$ Elements

F. K. Hwang

pp. 298-320

BibTeX  Abstract Full Text:  PDF

New Fast Algorithms for Matrix Operations

V. Ya. Pan

pp. 321-342

BibTeX  Abstract Full Text:  PDF

On the Polyhedral Decision Problem

Andrew C. Yao and Ronald L. Rivest

pp. 343-347

BibTeX  Abstract Full Text:  PDF

Path Systems: Constructions, Solutions and Applications

Eitan M. Gurari and Oscar H. Ibarra

pp. 348-374

BibTeX  Abstract Full Text:  PDF

Code Motion

John H. Reif

pp. 375-395

BibTeX  Abstract Full Text:  PDF

On the Computational Complexity of Program Scheme Equivalence

H. B. Hunt III, R. L. Constable, and S. Sahni

pp. 396-416

BibTeX  Abstract Full Text:  PDF

Saving Space in Fast String-Matching

Zvi Galil and Joel Seiferas

pp. 417-438

BibTeX  Abstract Full Text:  PDF

Corrigendum: A Family of Algorithms for Powering Sparse Polynomials

David K. Probst and Vangalur S. Alagar

p. 439

BibTeX  Abstract Full Text:  PDF